Top-Down Evolutionary Image Segmentation Using a Hierarchical Social Metaheuristic
نویسندگان
چکیده
This paper presents an application of a hierarchical social (HS) metaheuristic to region-based segmentation. The original image is modelled as a simplified image graph, which is successively partitioned into two regions, corresponding to the most significant components of the actual image, until a termination condition is met. The graph-partitioning task is solved as a variant of the min-cut problem (normalized cut) using an HS metaheuristic. The computational efficiency of the proposed algorithm for the normalized cut computation improves the performance of a standard genetic algorithm. We applied the HS approach to brightness segmentation on various synthetic and real images, with stimulating trade-off results between execution time and segmentation quality.
منابع مشابه
Region Merging for Severe Oversegmented Images Using a Hierarchical Social Metaheuristic
This paper proposes a new evolutionary region merging method to improve segmentation quality result on oversegmented images. The initial segmented image is described by a modified Region Adjacency Graph model. In a second phase, this graph is successively partitioned in a hierarchical fashion into two subgraphs, corresponding to the two most significant components of the actual image, until a t...
متن کاملImproving image segmentation quality through effective region merging using a hierarchical social metaheuristic
This paper proposes a new evolutionary region merging method in order to efficiently improve segmentation quality results. Our approach starts from an oversegmented image, which is obtained by applying a standard morphological watershed transformation on the original image. Next, each resulting region is represented by its centroid. The oversegmented image is described by a simplified undirecte...
متن کاملA Graph-Based Image Segmentation Algorithm Using a Hierarchical Social Metaheuristic
This chapter proposes a new evolutionary graph-based image segmentation method to improve quality result. Our approach is quite general and can be considered as a pixel or region based segmentation technique. What is more important is that they (pixels or regions) are not necessarily adjacent. It starts from an image described by a simplified undirected weighted graph where nodes represent eith...
متن کاملA Fast Hybrid Color Segmentation Method
We introduce a very general method of achieving stable and fast color segmentation. This method works on diierent hierarchical data structures and combines local bottom-up region growing segmentation with top-down separation techniques. As our method supports exploitation of inherent parallelism, a real-time object detection has been designed and is in the implementation phase.
متن کاملRobust Model-Based Algorithm for Range Image Segmentation
his paper presents a novel range image segmentation algorithm based on a newly proposed obust estimator: Adaptive Scale Sample Consensus (ASSC) [28]. The proposed algorithm is a odel-based top-down technique and directly extracts the required primitives (models) from the aw images. Compared with current popular methods (region-based and edge-based methods), the lgorithm is very robust to noisy ...
متن کامل